Boolean algebra

Results: 1241



#Item
51Logic / Mathematical logic / Theoretical computer science / Boolean algebra / Logic in computer science / Formal methods / Classical logic / Formal verification / Model checking / Modal logic / Propositional calculus / Temporal logic

Modular Verification of Open Features Through Three-Valued Model Checking  Harry C. Li Brown University, USA

Add to Reading List

Source URL: web.cs.wpi.edu

Language: English - Date: 2004-05-02 20:58:40
52Software engineering / Computing / Computer programming / Boolean algebra / Data types / Concurrent programming languages / Object-oriented programming languages / Boolean data type / Boolean expression / ALGOL 68 / Java / Const

Piazza  Stats • • •

Add to Reading List

Source URL: cs.brown.edu

Language: English - Date: 2015-10-06 14:56:29
53Mathematics / Computing / Mathematical logic / Database theory / Complexity classes / Boolean algebra / Algebraic structures / Relational model / Datalog / Relational algebra / Tuple / FO

Circuits for Datalog Provenance Daniel Deutch Tova Milo Tel Aviv University

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2013-12-16 04:18:28
54Algebraic logic / Boolean algebra / Lattice theory

CONTRIBUTIONS TO GENERAL ALGEBRA 12 Pro eedings of the Vienna Conferen e, June 3{6, 1999 Verlag Johannes Heyn, Klagenfurt 2000 IMPLICATIONS OF PROPERTIES CONCERNING COMPLEMENTATION IN FINITE LATTICES

Add to Reading List

Source URL: www.dr-dau.net

Language: English - Date: 2016-06-19 12:14:44
55Theoretical computer science / Computational complexity theory / Mathematics / Constraint programming / NP-complete problems / Boolean algebra / Parameterized complexity / Boolean satisfiability problem / Constraint satisfaction problem / Exponential time hypothesis / Treewidth / Tree decomposition

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-11-09 10:22:02
56Mathematics / Mathematical logic / Theoretical computer science / Automated theorem proving / Boolean algebra / Logic programming / Resolution / True quantified Boolean formula / Clause / Conflict-Driven Clause Learning / DPLL algorithm

Preprocessing Techniques for QBFs Enrico Giunchiglia1 , Paolo Marin1 , and Massimo Narizzano1 DIST - Universit`a di Genova Viale Causa 13, 16145 Genova, Italy Abstract

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2008-12-04 03:03:35
57Theoretical computer science / Mathematics / Formal methods / Constraint programming / Boolean algebra / Automated theorem proving / DPLL algorithm / Binary decision diagram / Exponential time hypothesis / Computational complexity theory / Bayesian network / Distribution

Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck

Add to Reading List

Source URL: www.haz.ca

Language: English - Date: 2013-10-28 07:18:32
58Logic / Mathematical logic / Mathematics / Model theory / Predicate logic / Finite model theory / Automated theorem proving / Boolean algebra / First-order logic / Resolution / FO / Interpretation

The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin? School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2010-03-23 07:22:00
59Mathematical analysis / Mathematics / Arithmetic / Computer arithmetic / Interval arithmetic / Numerical analysis / Inverse trigonometric functions / Boolean algebra / Holomorphic functional calculus

Verification Methods for Dense and Sparse Systems of Equations ∗ S.M. Rump, Hamburg In this paper we describe verification methods for dense and large sparse systems of linear and nonlinear equations. Most of the metho

Add to Reading List

Source URL: www.ti3.tu-harburg.de

Language: English - Date: 2005-11-23 04:44:10
60Logic / Mathematics / Abstraction / Boolean algebra / Semantics / Mathematical logic / Propositional calculus / Logical truth / Tautology / Truth table / Boolean / Negation

Worksheet on Truth Tables and Boolean Algebra September 24, Write a truth table for the logical statement ¬(P ∨ Q) =⇒ (¬P ∧ Q). Do it step by step (i.e. include columns for ¬P and P ∨ Q etc., building

Add to Reading List

Source URL: math.colorado.edu

Language: English - Date: 2015-12-04 19:21:57
UPDATE